Phase Transition for Random Quantified XOR-Formulas
نویسندگان
چکیده
The QXOR-SAT problem is the quantified version of the satisfiability problem XOR-SAT in which the connective exclusive-or is used instead of the usual or. We study the phase transition associated with random QXOR-SAT instances. We give a description of this phase transition in the case of one alternation of quantifiers, thus performing an advanced practical and theoretical study on the phase transition of a quantified problem.
منابع مشابه
Combining the k-CNF and XOR Phase-Transitions
The runtime performance of modern SAT solvers on random k-CNF formulas is deeply connected with the ‘phase-transition’ phenomenon seen empirically in the satisfiability of random k-CNF formulas. Recent universal hashing-based approaches to sampling and counting crucially depend on the runtime performance of SAT solvers on formulas expressed as the conjunction of both k-CNF and XOR constraints (...
متن کاملThe Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas
Recent universal-hashing based approaches to sampling and counting crucially depend on the runtime performance of SAT solvers on formulas expressed as the conjunction of both CNF constraints and variable-width XOR constraints (known as CNF-XOR formulas). In this paper, we present the first study of the runtime behavior of SAT solvers equipped with XOR-reasoning techniques on random CNF-XOR form...
متن کاملAnalytic description of the phase transition of inhomogeneous multigraphs
We introduce a new model of random multigraphs with colored vertices and weighted edges. It is similar to the inhomogeneous random graph model of Söderberg [18], extended by Bollobás, Janson and Riordan [6]. By means of analytic combinatorics, we then analyze the birth of complex components, which are components with at least two cycles. We apply those results to give a complete picture of the ...
متن کاملApproximating The Satisfiability Threshold For Random K-Xor-Formulas
In this paper we study random linear systems with k variables per equation over the finite field GF (2), or equivalently k-XOR-CNF formulas. In a previous paper Creignou and Daudé proved that the phase transition for the consistency (satisfiability) of such systems (formulas) exhibits a sharp threshold. Here we prove that the phase transition occurs as the number of equations (clauses) is propo...
متن کاملNew Models for Generating Hard Random Boolean Formulas and Disjunctive Logic Programs
We propose two models of random quantified boolean formulas and their natural random disjunctive logic program counterparts. The models extend the standard models of random k-CNF formulas and the Chen-Interian model of random 2QBFs. The first model controls the generation of programs and QSAT formulas by imposing a specific structure on rules and clauses, respectively. The second model is based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Artif. Intell. Res.
دوره 29 شماره
صفحات -
تاریخ انتشار 2007